A pattern-based object calculus

A Delegation-based Object Calculus with Subtying

This paper presents an untyped object calculus that reeects the capabilities of so-called delegation-based object-oriented languages. A type inference system allows static detection of errors, such as message not understood, while at the same time allowing the type of an inherited method to be specialized to the type of the inheriting object. The main advance over previous work is the provision...

Pattern { Based Object { Oriented

A Typed Pattern Calculus

The theory of programming with pattern-matching function deenitions has been studied mainly in the framework of rst-order rewrite systems. We present a typed functional calculus that emphasizes the strong connection between the structure of whole pattern deenitions and their types. In this calculus type-checking guarantees the absence of runtime errors caused by non-exhaustive pattern-matching ...

A transactional object calculus

A transaction defines a locus of computation that satisfies important concurrency and failure properties. These so-called ACID properties provide strong serialization guarantees that allow us to reason about concurrent and distributed programs in terms of higher-level units of computation (e.g., transactions) rather than lower-level data structures (e.g., mutual-exclusion locks). This paper pre...

A distributed object calculus

Distributed object-oriented languages are becoming increasingly accepted as network programming languages. The success of Java, and the Java security model in particular, has made the study of type systems for OO languages critical to the success of distributed programming. Abadi and Cardelli [1] have provided an excellent framework for the study of object-based OO languages in the object calcu...